Search results for "Cellular automaton"

Abstracts from the CECAM workshop on computer simulations of cellular automata

1989

Female sexual signaling in a capital breeder, the European glow-worm Lampyris noctiluca

2021

AbstractTheory predicts that because costs constrain female sexual signaling, females are expected to have a low signaling effort that is increased with passing time until mating is secured. This pattern of signaling is expected to result from females balancing the costs associated with a higher than optimal signaling effort and those costs associated with a low signaling effort that increase the likelihood of delayed mating. We tested whether this prediction applies in the common glow-worm Lampyris noctiluca (Coleoptera, Lampyridae), a capital breeding species in which females glow at night to attract males. Contrary to predictions, we found that the duration of female sexual signaling sig…

Weakly coupled map lattice models for multicellular patterning and collective normalization of abnormal single-cell states

2017

We present a weakly coupled map lattice model for patterning that explores the effects exerted by weakening the local dynamic rules on model biological and artificial networks composed of two-state building blocks (cells). To this end, we use two cellular automata models based on: (i) a smooth majority rule (model I) and (ii) a set of rules similar to those of Conway's Game of Life (model II). The normal and abnormal cell states evolve according with local rules that are modulated by a parameter $\kappa$. This parameter quantifies the effective weakening of the prescribed rules due to the limited coupling of each cell to its neighborhood and can be experimentally controlled by appropriate e…

An attraction-based cellular automaton model for generating spatiotemporal population maps in urban areas

2015

We develop a cellular automaton (CA) model to produce spatiotemporal population maps that estimate population distributions in an urban area during a random working day. The resulting population maps are at 50 m and 5 minutes spatiotemporal resolution, showing clearly how the distribution of population varies throughout a 24-hour period. The maps indicate that some areas of the city, which are sparsely populated during the night, can be densely populated during the day. The developed CA model assumes that the population transition trends follow dynamics and propagation patterns similar to a contagious disease. Thus, our model designed to change the states of each grid cell (stable or dynami…

Arithmetical Analysis of Biomolecular Finite Automaton

2013

In the paper we present a theoretical analysis of extension of the finite automaton built on DNA (introduced by the Shapiro team) to an arbitrary number of states and symbols. In the implementation we use a new idea of several restriction enzymes instead of one. We give arithmetical conditions for the existence of such extensions in terms of ingredients used in the implementation.

Research of Complex Forms in Cellular Automata by Evolutionary Algorithms

2004

This paper presents an evolutionary approach for the search for new complex cellular automata. Two evolutionary algorithms are used: the first one discovers rules supporting gliders and periodic patterns, and the second one discovers glider guns in cellular automata. An automaton allowing us to simulate AND and NOT gates is discovered. The results are a step toward the general simulation of Boolean circuits by this automaton and show that the evolutionary approach is a promising technic for searching for cellular automata that support universal computation.

A New Universal Cellular Automaton Discovered by Evolutionary Algorithms

2004

In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers provides elements of answer, as it describes how another universal cellular automaton than the Game of Life (Life) was sought and found using evolutionary algorithms. This paper includes a demonstration that consists in showing that the presented R automaton can both implement any logic circuit (logic universality) and a simulation of Life (universality in the Turing sense).

Aldonis Vēriņš (1929–2020), Latvian Ornamental Plants Breeder

2020

GTVcut for neuro-radiosurgery treatment planning: an MRI brain cancer seeded image segmentation method based on a cellular automata model

2018

Despite of the development of advanced segmentation techniques, achieving accurate and reproducible gross tumor volume (GTV) segmentation results is still an important challenge in neuro-radiosurgery. Nowadays, magnetic resonance imaging (MRI) is the most prominent modality in radiation therapy for soft-tissue anatomical districts. Gamma Knife stereotactic neuro-radiosurgery is a minimally invasive technology for dealing with inaccessible or insufficiently treated tumors with traditional surgery or radiotherapy. During a treatment planning phase, the GTV is generally contoured by experienced neurosurgeons and radiation oncologists using fully manual segmentation procedures on MR images. Unf…

Modeling Local Social Migrations: A Cellular Automata Approach

2015

In local social migrations, agents move from their initial location looking for a better local social environment. Social migrations processes do not change the number of social agents of a given type (i.e., the empirical distribution of the population) but their spatial location. Although cellular automata seems to appear as a natural approach to model of social migrations, the evolution of the configuration through a cellular automata might induce a new configuration wherein the number of agents of each type might be actually modified. This article provides a characterization of these cellular automata rules such that for any initial empirical distribution, the evolution of the configurat…